Role Conjunctions in Expressive Description Logics

نویسندگان

  • Birte Glimm
  • Yevgeny Kazakov
چکیده

We show that adding role conjunctions to the Description Logics (DLs) SHI and SHOIF causes a jump in the computational complexity of the standard reasoning tasks from ExpTime-complete to 2ExpTime-complete and from NExpTime-complete to N2ExpTime-hard respectively. We further show that this increase is due to a subtle interaction between inverse roles, role hierarchies, and role transitivity in the presence of role conjunctions and that for the DL SHQ a jump in the computational complexity cannot be observed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Expressive Number Restrictions in Description Logics

We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role construc-tors. In particular, we are mainly interested in Logics (called ALC N) allowing for the same kind of complex roles both in number and in value restrictions, which represent very expressive description languages and can be shown very useful for applications....

متن کامل

Classifying Description Logics

We describe a method for characterizing the expressive power of description logics. The method is essentially model-theoretic in nature, and it is applied to obtain expressiveness results for a wide range of logics in the well-known FL− and AL hierarchies. As a corollary we obtain a complete classification of the relative expressive power of these logics.

متن کامل

Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles

In a previous paper we have investigated subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. In this paper we show that subsumption...

متن کامل

Foreign Affairs and Trade

It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008